Joint Detection/Decoding Algorithms for Nonbinary LDPC Codes over ISI Channels

نویسندگان

  • Shancheng Zhao
  • Zhifei Lu
  • Xiao Ma
  • Baoming Bai
چکیده

This paper is concerned with the application of nonbinary low-density parity-check (NB-LDPC) codes to binary input inter-symbol interference (ISI) channels. Two low-complexity joint detection/decoding algorithms are proposed. One is referred to as max-log-MAP/X-EMS algorithm, which is implemented by exchanging soft messages between the max-log-MAP detector and the extended min-sum (EMS) decoder. The max-log-MAP/X-EMS algorithm is applicable to general NB-LDPC codes. The other one, referred to as Viterbi/GMLGD algorithm, is designed in particular for majority-logic decodable NB-LDPC codes. The Viterbi/GMLGD algorithm works in an iterative manner by exchanging harddecisions between the Viterbi detector and the generalized majority-logic decoder (GMLGD). As a byproduct, a variant of the original EMS algorithm is proposed, which is referred to as μ-EMS algorithm. In the μ-EMS algorithm, the messages are truncated according to an adaptive threshold, resulting in a more efficient algorithm. Simulations results show that the max-log-MAP/X-EMS algorithm performs as well as the traditional iterative detection/decoding algorithm based on the BCJR algorithm and the QSPA, but with lower complexity. The complexity can be further reduced for majority-logic decodable NB-LDPC codes by executing the Viterbi/GMLGD algorithm with a performance degradation within one dB. Simulation results also confirm that the μ-EMS algorithm requires lower computational loads than the EMS algorithm with a fixed threshold. These algorithms provide good candidates for trade-offs between performance and complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations

In this paper, we investigate the application of nonbinary low density parity check (LDPC) codes over Galois field GF(q) for both single-input single-output (SISO) and multipleinput multiple-output (MIMO) fading channels using higher order modulations. As opposed to the widely studied binary systems that employ joint detection and channel decoding, we propose a nonbinary system where optimal si...

متن کامل

Low-Density Parity-Check Codes for Data Storage and

For high density magnetic recording channels and memory systems, low-density parity-check (LDPC) codes with probabilistic decoding are replacing Reed-Solomon (RS) codes or Bose-Chaudhuri-Hocquenghem (BCH) codes with conventional algebraic decoding. The main benefit of LDPC codes over the RS and BCH codes is that LDPC codes can provide lower error probabilities than equivalent conventional codes...

متن کامل

Efficient detection and decoding of q-ary LDPC coded signals over partial response channels

In this study, we consider the ways for concatenating the intersymbol interference (ISI) detector with a q-ary lowdensity parity-check (LDPC) decoder for transmissions over partial response (PR) channels. LDPC codes allow achieving performance close to the channel capacity in additive white Gaussian noise channels, while designing receivers employing these codes for transmissions over channels ...

متن کامل

BP-LED decoding algorithm for LDPC codes over AWGN channels

A new method for low-complexity near-maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over the additive white Gaussian noise channel is presented. The proposed method termed beliefpropagation–list erasure decoding (BP-LED) is based on erasing carefully chosen unreliable bits performed in case of BP decoding failure. A strategy of introducing erasures into the received v...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1209.2542  شماره 

صفحات  -

تاریخ انتشار 2012